#include <iostream>
#include <vector>
#include "QuickSort.h"

using namespace std;

template<typename Comparable>
void Print(const vector<Comparable>& _data )
{
	cout << endl;
	cout << endl;
	for (typename vector<Comparable>::const_iterator it = _data.begin(); it != _data.end(); ++it)
	{
		if(it != _data.begin())
			cout << ",";
		cout << *it;
	}
	cout << endl;
	cout << endl;
}

int main()
{
	vector<int> Test;
	int RandAmount = 0;
	srand(unsigned(time(NULL)));

	cout << "Key In Random Num Spawn Amount" << endl;

	cin >> RandAmount;

	for (int i = 0; i < RandAmount; i++)
	{
		Test.push_back(rand() % 100);
	}

	Print( Test );

	Sort( Test );

	Print( Test );

	cin.get();
	cin.get();

	return 0;
}